Ordinal properties of tree distances
نویسندگان
چکیده
منابع مشابه
Ordinal Distances in Transfinite Graphs
An ordinal-valued metric, taking its values in the set א1 of all countable ordinals, can be assigned to a metrizable set M of nodes in any transfinite graph. M contains all the nonsingleton nodes, as well as certain singleton nodes. Moreover, this yields a graphical realization of Cantor’s countable ordinals, as well as of the Aristotelian ideas of “potential” and “actual” infinities, the forme...
متن کاملTree Representations via Ordinal Machines
We study sets of reals computable by ordinal Turing machines with a tape of length the ordinals that are steered by a standard Turing program. The machines halt at some ordinal time or diverge. We construct tree representations for ordinal semidecidable sets of reals from ordinal computations. The aim is to generalize uniformization results to classes of sets which are semi-decidable by computa...
متن کاملExploitation of Pairwise Class Distances for Ordinal Classification
Ordinal classification refers to classification problems in which the classes have a natural order imposed on them because of the nature of the concept studied. Some ordinal classification approaches perform a projection from the input space to one-dimensional (latent) space that is partitioned into a sequence of intervals (one for each class). Class identity of a novel input pattern is then de...
متن کاملIncomplete Ordinal Information in Value Tree Analysis
In value tree analysis, additive value functions are used to model alternatives' overall values. Diculties in complete evaluation of alternatives' attribute-specic values (scores) and attributes' relative importance have spurred research on the modeling of incomplete preference information. This thesis shows how incomplete ordinal information, captured as ordinal information where a set of rank...
متن کاملTree Automata Make Ordinal Theory Easy
We give a new simple proof of the decidability of the First Order Theory of (ω i ,+) and the Monadic Second Order Theory of (ω, <), improving the complexity in both cases. Our algorithm is based on tree automata and a new representation of (sets of) ordinals by (infinite) trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00068-5